Application of ant colony optimization metaheuristic on set covering problems

Ant Colony Optimization (ACO) metaheuristic is a multi-agent system in which the behaviour of each ant inspired by foraging real ants to solve optimization problem. Set Covering Problems (SCP), on other hand, deal with maximizing coverage every subset while weight nodes used must be minimized. In this paper, ACO was adapted and case Problem. The for solving SCP implemented as computer program using SciLab 5.4.1. problem determining optimal location Wi-Fi Access Points 802.11n protocol UP Los Banos Math Building solved metaheuristic. Results show that order have 100% MB, 7 access points are required. Methodology study can results decision makers related problems.